C R Rao and Mahalanobis’ distance

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mahalanobis’ Distance beyond Normal Distributions

Based on the reasoning expressed by Mahalanobis in his original article, the present article extends the Mahalanobis distance beyond the set of normal distributions. Sufficient conditions for existence and uniqueness are studied, and some properties derived. Since many statistical methods use the Mahalanobis distance as e vehicle, e.g. the method of least squares and the chi-square hypothesis t...

متن کامل

Optimal Rescaling and the Mahalanobis Distance

One of the basic problems in data analysis lies in choosing the optimal rescaling (change of coordinate system) to study properties of a given data-set Y . The classical Mahalanobis approach has its basis in the classical normalization/rescaling formula Y 3 y → Σ Y · (y − mY ), where mY denotes the mean of Y and ΣY the covariance matrix . Based on the cross-entropy we generalize this approach a...

متن کامل

MDQC: Mahalanobis Distance Quality Control

The process of producing microarray data involves multiple steps, some of which may suffer from technical problems and seriously damage the quality of the data. Thus, it is essential to identify those arrays with low quality. Our Mahalanobis Distance Quality Control (MDQC) is a multivariate quality assessment method for microarrays that is based on the similarity of quality measures across arra...

متن کامل

On Kernelizing Mahalanobis Distance Learning Algorithms

This paper focuses on the problem of kernelizing an existing supervised Mahalanobis distance learner. The following features are included in the paper. Firstly, three popular learners, namely, “neighborhood component analysis”, “large margin nearest neighbors” and “discriminant neighborhood embedding”, which do not have kernel versions are kernelized in order to improve their classification per...

متن کامل

Normalized Clustering Algorithm Based on Mahalanobis Distance

FCM (fuzzy c-means algorithm) based on Euclidean distance function converges to a local minimum of the objective function, which can only be used to detect spherical structural clusters. The added fuzzy covariance matrices in their distance measure were not directly derived from the objective function. In this paper, an improved Normalized Clustering Algorithm Based on Mahalanobis distance by t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings - Mathematical Sciences

سال: 2020

ISSN: 0253-4142,0973-7685

DOI: 10.1007/s12044-020-00586-4